Trees with two disjoint minimum independent dominating sets
نویسندگان
چکیده
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Cohabitation of Independent Sets and Dominating Sets in Trees
We give a constructive characterization of trees that have a maximum independent set and a minimum dominating set which are disjoint and show that the corresponding decision problem is NP-complete for general graphs.
متن کاملA Note on Disjoint Dominating Sets in Graphs
The disjoint domination number γγ(G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of γγ(G) for several graphs and give partial answers to...
متن کاملOn graphs with disjoint dominating and 2-dominating sets
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only con...
متن کاملAlmost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one ...
متن کاملA characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
Let G be a connected graph with vertex set V (G). A set S of vertices in G is called a weakly connected dominating set of G if (i) S is a dominating set of G and (ii) the graph obtained from G by removing all edges joining two vertices in V (G) \ S is connected. A weakly connected dominating set S of G is said to be minimum or a γw-set if |S| is minimum among all weakly connected dominating set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 304 شماره
صفحات -
تاریخ انتشار 2005